Simplex algorithm

Results: 160



#Item
31Game theory / Bimatrix game / LemkeHowson algorithm / Nash equilibrium / Brouwer fixed-point theorem / Solution concept / Simplex / Coordination game

A Geometric-Combinatorial Approach to Index and Stability in Bimatrix Games Arndt von Schemde London School of Economics and Political Science

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2004-12-17 18:00:11
32Mathematics / Geometry / Space / Polytopes / Topology / Polyhedral combinatorics / Game theory / LemkeHowson algorithm / Cyclic polytope / Simplex / Bimatrix game / Simple polytope

Electronic Notes in Discrete Mathematics–1072 Finding Gale Strings Marta M. Casetti, Julian Merschen, Bernhard von Stengel Dept. of Mathematics, London School of Economics, London WC2A 2AE, United Kingd

Add to Reading List

Source URL: www.maths.lse.ac.uk

Language: English - Date: 2010-07-17 09:49:35
33

AM 121: Intro to Optimization Models and Methods Lecture 5: Tableau, first look at the simplex algorithm Yiling Chen

Add to Reading List

Source URL: am121.seas.harvard.edu

Language: English - Date: 2015-09-21 01:01:33
    34Algebra / Mathematics / Abstract algebra / Polytopes / Lie groups / Lie algebras / Algebraic geometry / Ehrhart polynomial / Valuation / Lattice / Distribution / Weight

    COMPUTING THE EHRHART QUASI-POLYNOMIAL OF A RATIONAL SIMPLEX Alexander Barvinok April 2005 We present a polynomial time algorithm to compute any fixed number of the highest

    Add to Reading List

    Source URL: www.math.lsa.umich.edu

    Language: English - Date: 2005-04-28 13:33:02
    35Mathematical analysis / Mathematics / Algebra / Linear algebra / Linear complementarity problem / Mathematical optimization / Simplex algorithm / Exponentiation / SturmLiouville theory / Hypergeometric function

    GAMES AND ECONOMIC BEHAVIOR ARTICLE NO. 14, 247–

    Add to Reading List

    Source URL: www.maths.lse.ac.uk

    Language: English - Date: 2002-11-18 18:28:12
    36

    The Simplex Algorithm is NP-mighty‡ Yann Disser∗ Abstract We propose to classify the power of algorithms by the complexity of the problems that they can be used to solve. Instead of restricting to the problem a parti

    Add to Reading List

    Source URL: www.coga.tu-berlin.de

    Language: English - Date: 2015-04-17 03:32:06
      37Polytopes / Game theory / LemkeHowson algorithm / Matching / Simplex

      arXiv:1210.4694v2 [cs.DM] 5 Apr 2014

      Add to Reading List

      Source URL: www.maths.lse.ac.uk

      Language: English - Date: 2014-12-05 13:17:13
      38

      The simplex algorithm and the Hirsch conjecture: Lecture 3

      Add to Reading List

      Source URL: madalgo.au.dk

      Language: English - Date: 2015-08-26 03:48:01
        39

        An Improved Version of the Random-Facet Pivoting Rule for the Simplex Algorithm Thomas Dueholm Hansen∗ Uri Zwick†

        Add to Reading List

        Source URL: cs.au.dk

        Language: English - Date: 2015-04-20 10:29:13
          40Combinatorial optimization / Graph theory / NP-complete problems / Network theory / Edsger W. Dijkstra / Steiner tree problem / Simplex / Matching / Bipartite graph / Graph / Shortest path problem / A* search algorithm

          On Survivable Access Network Design: Complexity and Algorithms Dahai Xu Elliot Anshelevich

          Add to Reading List

          Source URL: www.cs.rpi.edu

          Language: English - Date: 2011-07-18 11:44:43
          UPDATE